منابع مشابه
Competitive graph searches
We exemplify an optimisation criteria for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two problems arising from biocomputing, so-called Common Connected Components and Cograph Sandwich. The first problem can be defined as follows: given two graphs on the same set of n vertices, find the coarsest partition of the ...
متن کاملAccelerating Competitive Learning Graph Quantization
Vector quantization(VQ) is a lossy data compression technique from signal processing for which simple competitive learning is one standard method to quantize patterns from the input space. Extending competitive learning VQ to the domain of graphs results in competitive learning for quantizing input graphs. In this contribution, we propose an accelerated version of competitive learning graph qua...
متن کاملClique-Relaxed Competitive Graph Coloring
In this paper we investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color α is legal for a vertex if said vertex has no neighbors colored α. Other variations of the game change this definition of a legal color. For a fixed color ...
متن کاملCompetitive Algorithms for Layered Graph Traversal
A layered graph is a connected graph whose vertices are partitioned into sets L0 = {s}, L1, L2, ..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is max{|Li|}. In the on-line layered graph traversal problem, a searcher starts at s in a layered graph of unknown width and tries to reach a target vertex t; however, the vertices in layer i and ...
متن کاملCompetitive routing in the half-θ6-graph
We present a deterministic local routing scheme that is guaranteed to find a path between any pair of vertices in a halfθ6-graph whose length is at most 5/ √ 3 = 2.886... times the Euclidean distance between the pair of vertices. The half-θ6graph is identical to the Delaunay triangulation where the empty region is an equilateral triangle. Moreover, we show that no local routing scheme can achie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.10.048